<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: heap/leftistTree.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">heap/leftistTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * leftistTree.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"> * (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __LEFTISTTREE_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __LEFTISTTREE_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#include &lt;functional&gt;</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;cstring&gt;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#ifdef __DEBUG__</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span><span class="preprocessor">#include &lt;queue&gt;</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include &lt;utility&gt;</span>
<a name="l00029"></a>00029 <span class="preprocessor">#include &lt;iostream&gt;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#endif </span>
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="keyword">namespace </span>Heap {
<a name="l00032"></a>00032     <span class="keyword">template</span>&lt; <span class="keyword">class</span> _TypeData ,<span class="keyword">class</span> _TypeCompare=std::less&lt;_TypeData&gt; &gt; 
<a name="l00033"></a><a class="code" href="classHeap_1_1LeftistTree.html">00033</a>     <span class="keyword">class </span><a class="code" href="classHeap_1_1LeftistTree.html">LeftistTree</a> {
<a name="l00034"></a>00034         <span class="keyword">struct </span>Node {
<a name="l00035"></a>00035             _TypeData data;
<a name="l00036"></a>00036             <span class="keywordtype">int</span> dist;
<a name="l00037"></a>00037             Node* left;
<a name="l00038"></a>00038             Node* right;
<a name="l00039"></a>00039         }; <span class="comment">// TODO each node is a subtree -&gt; less speed/memory effective?</span>
<a name="l00040"></a>00040         Node* root;
<a name="l00041"></a>00041         Node* merge_subtree(Node* ptrRootA,Node* ptrRootB) {
<a name="l00042"></a>00042             Node* tmp;
<a name="l00043"></a>00043             <span class="keywordflow">if</span>(!ptrRootA) <span class="keywordflow">return</span> ptrRootB;
<a name="l00044"></a>00044             <span class="keywordflow">if</span>(!ptrRootB) <span class="keywordflow">return</span> ptrRootA;
<a name="l00045"></a>00045             <span class="keywordflow">if</span>(ptrRootA-&gt;data &lt; ptrRootB-&gt;data) {tmp=ptrRootA;ptrRootA=ptrRootB;ptrRootB=tmp;} <span class="comment">//A always &gt;= B</span>
<a name="l00046"></a>00046             <span class="comment">//merge B into right of A.</span>
<a name="l00047"></a>00047 <span class="preprocessor">            #ifdef __DEBUG__</span>
<a name="l00048"></a>00048 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Merge &quot;</span>&lt;&lt;ptrRootA-&gt;right&lt;&lt;<span class="stringliteral">&quot; with &quot;</span>&lt;&lt;ptrRootB&lt;&lt;std::endl;
<a name="l00049"></a>00049 <span class="preprocessor">            #endif</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span>            ptrRootA-&gt;right=merge_subtree(ptrRootA-&gt;right,ptrRootB);
<a name="l00051"></a>00051             <span class="comment">//swap left/right if dist(left) &lt; dist(right)</span>
<a name="l00052"></a>00052 <span class="preprocessor">            #ifdef __DEBUG__</span>
<a name="l00053"></a>00053 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Left &quot;</span>&lt;&lt;ptrRootA-&gt;left&lt;&lt;<span class="stringliteral">&quot; right &quot;</span>&lt;&lt;ptrRootA-&gt;right&lt;&lt;std::endl;
<a name="l00054"></a>00054 <span class="preprocessor">            #endif</span>
<a name="l00055"></a>00055 <span class="preprocessor"></span>            <span class="keywordflow">if</span>( !ptrRootA-&gt;left || ptrRootA-&gt;left-&gt;dist &lt; ptrRootA-&gt;right-&gt;dist) { tmp=ptrRootA-&gt;left;ptrRootA-&gt;left=ptrRootA-&gt;right;ptrRootA-&gt;right=tmp;}
<a name="l00056"></a>00056             <span class="comment">//update dist of root</span>
<a name="l00057"></a>00057             <span class="keywordflow">if</span>(ptrRootA-&gt;right) ptrRootA-&gt;dist=1+(ptrRootA-&gt;right-&gt;dist);
<a name="l00058"></a>00058             <span class="keywordflow">return</span> ptrRootA;
<a name="l00059"></a>00059         };
<a name="l00060"></a>00060         <span class="keywordtype">void</span> deleteSubtree(Node* ptrNodeToDelete) {
<a name="l00061"></a>00061             <span class="keywordflow">if</span>(ptrNodeToDelete-&gt;left) deleteSubtree(ptrNodeToDelete-&gt;left);
<a name="l00062"></a>00062             <span class="keywordflow">if</span>(ptrNodeToDelete-&gt;right) deleteSubtree(ptrNodeToDelete-&gt;right);
<a name="l00063"></a>00063 <span class="preprocessor">            #ifdef __DEBUG__</span>
<a name="l00064"></a>00064 <span class="preprocessor"></span>            std::cout&lt;&lt;<span class="stringliteral">&quot;Delete &quot;</span>&lt;&lt;ptrNodeToDelete&lt;&lt;<span class="stringliteral">&quot;:&quot;</span>&lt;&lt;ptrNodeToDelete-&gt;data&lt;&lt;std::endl;
<a name="l00065"></a>00065 <span class="preprocessor">            #endif</span>
<a name="l00066"></a>00066 <span class="preprocessor"></span>            <span class="keywordflow">if</span>(ptrNodeToDelete) <span class="keyword">delete</span> ptrNodeToDelete;
<a name="l00067"></a>00067         };
<a name="l00068"></a>00068         <span class="keyword">public</span>:
<a name="l00069"></a>00069         <a class="code" href="classHeap_1_1LeftistTree.html">LeftistTree</a>() {
<a name="l00070"></a>00070             root=NULL;
<a name="l00071"></a>00071         };
<a name="l00072"></a>00072         ~<a class="code" href="classHeap_1_1LeftistTree.html">LeftistTree</a>() {
<a name="l00073"></a>00073             <span class="keywordflow">if</span>(root) deleteSubtree(root);
<a name="l00074"></a>00074         }; 
<a name="l00075"></a>00075         <span class="keywordtype">void</span> merge_in(<a class="code" href="classHeap_1_1LeftistTree.html">LeftistTree&lt;_TypeData,_TypeCompare&gt;</a>&amp; treeB) {
<a name="l00076"></a>00076             root=merge_subtree(root,treeB.root);
<a name="l00077"></a>00077             treeB.root=NULL;
<a name="l00078"></a>00078         };  
<a name="l00079"></a>00079         <span class="keywordtype">void</span> push(_TypeData data) {
<a name="l00080"></a>00080            Node* ptrNewNode= <span class="keyword">new</span> Node;
<a name="l00081"></a>00081            ptrNewNode-&gt;data=data;
<a name="l00082"></a>00082            ptrNewNode-&gt;dist=0;
<a name="l00083"></a>00083            ptrNewNode-&gt;left=NULL; <span class="comment">//TODO necessary? </span>
<a name="l00084"></a>00084            ptrNewNode-&gt;right=NULL;
<a name="l00085"></a>00085 <span class="preprocessor">           #ifdef __DEBUG__</span>
<a name="l00086"></a>00086 <span class="preprocessor"></span>           std::cout&lt;&lt;<span class="stringliteral">&quot;Insert &quot;</span>&lt;&lt;data&lt;&lt;std::endl;
<a name="l00087"></a>00087            std::cout&lt;&lt;<span class="stringliteral">&quot;Root: &quot;</span>&lt;&lt;root&lt;&lt;<span class="stringliteral">&quot; New: &quot;</span>&lt;&lt;ptrNewNode&lt;&lt;std::endl;
<a name="l00088"></a>00088 <span class="preprocessor">           #endif</span>
<a name="l00089"></a>00089 <span class="preprocessor"></span>           root=merge_subtree(root,ptrNewNode);
<a name="l00090"></a>00090         };
<a name="l00091"></a>00091         _TypeData pop() {
<a name="l00092"></a>00092             _TypeData data=root-&gt;data;
<a name="l00093"></a>00093             Node* tmp=root;
<a name="l00094"></a>00094             root=merge_subtree(root-&gt;left,root-&gt;right);
<a name="l00095"></a>00095             <span class="keyword">delete</span> tmp;
<a name="l00096"></a>00096             <span class="keywordflow">return</span> data;
<a name="l00097"></a>00097         };
<a name="l00098"></a>00098         _TypeData top() {
<a name="l00099"></a>00099             <span class="keywordflow">return</span> root-&gt;data;
<a name="l00100"></a>00100         };
<a name="l00101"></a>00101         <span class="keywordtype">bool</span> empty() {
<a name="l00102"></a>00102             <span class="keywordflow">return</span> root? <span class="keyword">false</span>:<span class="keyword">true</span>;
<a name="l00103"></a>00103         };
<a name="l00104"></a>00104 <span class="preprocessor">        #ifdef __DEBUG__</span>
<a name="l00105"></a>00105 <span class="preprocessor"></span>        <span class="keywordtype">int</span> maxdepth(Node* root) {
<a name="l00106"></a>00106             <span class="keywordflow">if</span>(!root) <span class="keywordflow">return</span> 0;
<a name="l00107"></a>00107             <span class="keywordtype">int</span> left=maxdepth(root-&gt;left);
<a name="l00108"></a>00108             <span class="keywordtype">int</span> right=maxdepth(root-&gt;right);
<a name="l00109"></a>00109             <span class="keywordflow">return</span> left&gt;right? left+1:right+1;
<a name="l00110"></a>00110         }
<a name="l00111"></a>00111         <span class="keywordtype">void</span> print() {
<a name="l00112"></a>00112             <span class="keywordtype">int</span> depth=maxdepth(root);
<a name="l00113"></a>00113             std::queue&lt; std::pair&lt;std::pair&lt;int,int&gt;,Node*&gt; &gt; NodesList;
<a name="l00114"></a>00114             Node* ptrNode=root;
<a name="l00115"></a>00115             std::pair&lt;std::pair&lt;int,int&gt;,Node*&gt; pairNode;
<a name="l00116"></a>00116             <span class="keywordtype">int</span> level=-1,nth=0,last=0;
<a name="l00117"></a>00117             <span class="comment">//If empty</span>
<a name="l00118"></a>00118             <span class="keywordflow">if</span>(!ptrNode) {std::cout&lt;&lt;<span class="stringliteral">&quot;Heap Empty.&quot;</span>&lt;&lt;std::endl;<span class="keywordflow">return</span>;}
<a name="l00119"></a>00119             NodesList.push(std::make_pair(std::make_pair(level+1,nth),root));
<a name="l00120"></a>00120             <span class="keywordflow">while</span>( ! NodesList.empty()) {
<a name="l00121"></a>00121                 pairNode=NodesList.front();
<a name="l00122"></a>00122                 NodesList.pop();
<a name="l00123"></a>00123                 <span class="keywordflow">if</span>(pairNode.first.first &gt; level) {
<a name="l00124"></a>00124                     <span class="comment">//enter new level</span>
<a name="l00125"></a>00125                     std::cout&lt;&lt;std::endl&lt;&lt;<span class="stringliteral">&quot;Level &quot;</span>&lt;&lt;level+1&lt;&lt;<span class="stringliteral">&quot; : &quot;</span>;
<a name="l00126"></a>00126                     <span class="comment">//std::cout&lt;&lt;(1&lt;&lt;(depth-level-2))-1&lt;&lt;&quot;,&quot;&lt;&lt;(1&lt;&lt;(depth-level-1))-1;</span>
<a name="l00127"></a>00127                     <span class="keywordflow">for</span>(<span class="keyword">register</span> <span class="keywordtype">int</span> i=0;i&lt;(1&lt;&lt;(depth-level-2))-1;i++) std::cout&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00128"></a>00128                     last=0;
<a name="l00129"></a>00129                 }
<a name="l00130"></a>00130                 level=pairNode.first.first;nth=pairNode.first.second;ptrNode=pairNode.second;
<a name="l00131"></a>00131                 <span class="keywordflow">for</span>(<span class="keyword">register</span> <span class="keywordtype">int</span> i=0;i&lt;((1&lt;&lt;(depth-level)))*(nth-last)-1;i++) std::cout&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;
<a name="l00132"></a>00132                 <span class="keywordflow">if</span>(ptrNode) std::cout&lt;&lt;ptrNode-&gt;data;
<a name="l00133"></a>00133                 <span class="keywordflow">else</span> std::cout&lt;&lt;<span class="stringliteral">&quot;x&quot;</span>;
<a name="l00134"></a>00134                 <span class="comment">//std::cout&lt;&lt;&quot;,&quot;&lt;&lt;nth&lt;&lt;&quot;,&quot;&lt;&lt;last;</span>
<a name="l00135"></a>00135                 last=nth;
<a name="l00136"></a>00136                 <span class="keywordflow">if</span>( ptrNode-&gt;left) NodesList.push(std::make_pair(std::make_pair(level+1,2*nth),ptrNode-&gt;left));
<a name="l00137"></a>00137                 <span class="keywordflow">if</span>( ptrNode-&gt;right) NodesList.push(std::make_pair(std::make_pair(level+1,2*nth+1),ptrNode-&gt;right));
<a name="l00138"></a>00138             }
<a name="l00139"></a>00139             std::cout&lt;&lt;std::endl;
<a name="l00140"></a>00140         };
<a name="l00141"></a>00141 <span class="preprocessor">        #endif</span>
<a name="l00142"></a>00142 <span class="preprocessor"></span>
<a name="l00143"></a>00143     };
<a name="l00144"></a>00144 };
<a name="l00145"></a>00145 
<a name="l00146"></a>00146 <span class="preprocessor">#endif </span><span class="comment">/* __LEFTISTTREE_H__ */</span>
<a name="l00147"></a>00147 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
